Revisiting Fast Practical Byzantine Fault Tolerance
نویسندگان
چکیده
In this note, we observe a safety violation in Zyzzyva [7, 9, 8] and a liveness violation in FaB [14, 15]. To demonstrate these issues, we require relatively simple scenarios, involving only four replicas, and one or two view changes. In all of them, the problem is manifested already in the first log slot.
منابع مشابه
Revisiting Fast Practical Byzantine Fault Tolerance: Thelma, Velma, and Zelma
In a previous note [1], we observed a safety violation in Zyzzyva [7, 9, 8] and a liveness violation in FaB [12, 13]. In this manuscript, we sketch fixes to both. The same view-change core is applied in the two schemes, and additionally, applied to combine them and create a single, enhanced scheme that has the benefits of both approaches.
متن کاملTangaroa: a Byzantine Fault Tolerant Raft
We propose a Byzantine Fault Tolerant variant of the Raft consensus algorithm, BFTRaft, inspired by the original Raft[1] algorithm and the Practical Byzantine Fault Tolerance algorithm[2]. BFT Raft maintains the safety, fault tolerance, and liveness properties of Raft in the presence of Byzantine faults, while also aiming towards to Raft’s goal of simplicity and understandability. We have imple...
متن کاملLila: A Cheating-Resistant Distributed Game Engine
In this paper we present Lila, a distributed multiplayer game engine that is Byzantine faulttolerant. Lila allows games to be written with little regard for issues such as move replication, rejection of cheating moves, allowing new players to join the game, allowing players to leave the game, and removing cheating or networkpartitioned players from the game. Lila is based on Practical Byzantine...
متن کاملRecent Results on Fault-Tolerance Consensus in Message-Passing Networks
This paper surveys recent results on fault-tolerant consensus in message-passing networks. We focus on two categories of works: (i) new problem formulations (including input domain, fault model, network model...etc.), and (ii) practical applications. For the second part, we focus on Crash Fault-Tolerant (CFT) systems that use Paxos or Raft, and Byzantine Fault-Tolerant (BFT) systems. We also br...
متن کاملByzantine Fault Tolerance Can Be Fast
Byzantine fault tolerance is important because it can be used to implement highly-available systems that tolerate arbitrary behaviorfrom faulty components. This paper presents a detailed performance evaluation of BFT, a state-machine replication algorithm that tolerates Byzantine faults in asynchronous systems. Our results contradict the common belief that Byzantine fault tolerance is too slow ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.01367 شماره
صفحات -
تاریخ انتشار 2017